Indexing Open Schemas
نویسندگان
چکیده
Significant work has been done towards achieving the goal of placing semistructured data on an equal footing with relational data. While much attention has been paid to performance issues, far less work has been done to address one of the fundamental issues of semistructured data: schema evolution. Semistructured indexing and storage solutions tend to end where schema evolution begins. In practice, a real promise of semistructured data management will be realized where schemas evolve and change. In contrast to fixed schemas, we refer to schemas that grow and change as open schemas. This paper addresses the central complications associated with indexing open and evolving schemas: we specify the features and functionality that should be supported in order to handle evolving semistructured data. Specific contributions include a map of the steps for handling open schemas and an index for open schemas.
منابع مشابه
Indexing of Tables Referencing Complex Structures
We introduce indexing of tables referencing complex structures such as digraphs and spatial objects, appearing in genetics and other data intensive analysis. The indexing is achieved by extracting dimension schemas from the referenced structures. The schemas and their dimensionality are determined by proper coloring algorithms and the duality between all such schemas and all such possible prope...
متن کاملNutch: an Open-Source Platform for Web Search
Nutch is an open-source project providing both complete Web search software and a platform for the development of novel Web search methods. Nutch is built on a distributed storage and computing foundation, such that every operation scales to very large collections. Core algorithms crawl, parse and index Web-based data. Plugins extend functionality at various points, including network protocols,...
متن کاملSearching XML Databases for Semantically-related Schemas
In this paper, we address the problem of searching schema databases for semantically-related schemas. We first give a method of finding semantic similarity between pair-wise schemas based on tokenization, part-of-speech tagging, word expansion, and ontology matching. We then address the problem of indexing the schema database through a semantic hash table. Matching schemas in the database are f...
متن کاملAdvanced indexing schema for imaging applications: three case studies
Imaging techniques and applications often require heavy computations for finding the k-nearest-neighbour of a given pattern. Texture synthesis, image colourisation and super-resolution are all affected by this issue. Advanced clustering-based indexing schemas over metric spaces speed-up efficiently both k-nearest-neighbour and range searches. By using them, we are able to save CPU time without ...
متن کاملReusing Analysis Schemas in ODB Applications: a Chart Based Approach
This paper presents a method for creating, indexing and reusing analysis schemas in developing Objectoriented Data-base (ODB) applications. Analysis schemas are specified by using analysis charts, a useroriented set of forms structured according to the TQL Object-oriented specification model, and are classified according to their structural characteristics and content. A set of analysis charts ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002